Association Numbers in Liquid Systems from Intermolecular Free Length Relations.
نویسندگان
چکیده
منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملQuotient G-systems and Green\'s Relations
In this paper, we first introduce the concepts of G-systems, quotient G-systems and isomorphism theorems on G-systems of n-ary semihypergroups . Also we consider the Green's equivalences on G-systems and further in-vestigate some of their properties. A number of n-ary semihypergroups are constructed and presented as examples in this paper.
متن کاملRedundancy Free Mappings from relations toXMLMillist
Given the fact that relational and object-relational databases are the most widely used technology for storing data and that XML is the standard format used in electronic data interchange, the process of converting relational data to XML documents is one that occurs frequently. The problem that we address in this paper is an important one related to this process. If we convert a relation to an ...
متن کاملRedundancy Free Mappings from Relations to XML
Given the fact that relational and object relational databases are the most widely used technology for storing data and that XML is the standard format used in electronic data interchange the process of con verting relational data to XML documents is one that occurs frequently The problem that we address in this paper is an important one related to this process If we convert a relation to an XM...
متن کاملInteger Relations Among Algebraic Numbers
A vector m = (mx , ... , mn) eZ"\ {0} is called an integer relation for the real numbers a,, ... , an , if X)0,"1, = 0 holds. We present an algorithm that, when given algebraic numbers ax , ... , an and a parametere , either finds an integer relation for a,,... , an or proves that no relation of Euclidean length shorter than 1/e exists. Each algebraic number is assumed to be given by its minima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Chemica Scandinavica
سال: 1955
ISSN: 0904-213X
DOI: 10.3891/acta.chem.scand.09-0997